The minimum period of the Ehrhart quasi-polynomial of a rational polytope
نویسندگان
چکیده
If P ⊂ R is a rational polytope, then iP (n) := #(nP ∩Z ) is a quasipolynomial in n, called the Ehrhart quasi-polynomial of P . The period of iP (n) must divide D(P ) = min{n ∈ Z>0 : nP is an integral polytope}. Few examples are known where the period is not exactly D(P ). We show that for any D, there is a 2-dimensional triangle P such that D(P ) = D but such that the period of iP (n) is 1, that is, iP (n) is a polynomial in n. We also characterize all polygons P such that iP (n) is a polynomial. In addition, we provide a counterexample to a conjecture by T. Zaslavsky about the periods of the coefficients of the Ehrhart quasi-polynomial.
منابع مشابه
Quasi-period Collapse and GLn(Z)-Scissors Congruence in Rational Polytopes
Quasi-period collapse occurs when the Ehrhart quasi-polynomial of a rational polytope has a quasi-period less than the denominator of that polytope. This phenomenon is poorly understood, and all known cases in which it occurs have been proven with ad hoc methods. In this note, we present a conjectural explanation for quasi-period collapse in rational polytopes. We show that this explanation app...
متن کامل2 00 4 Computing the period of an Ehrhart quasi - polynomial
If P ⊂ R is a rational polytope, then iP (t) := #(tP ∩ Z ) is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P . A period of iP (t) is D(P ), the smallest D ∈ Z+ such that D · P has integral vertices. Often, D(P ) is the minimum period of iP (t), but, in several interesting examples, the minimum period is smaller. We prove that, for fixed d, there is a polynomial time algorithm...
متن کاملN ov 2 00 4 Computing the period of an Ehrhart quasi - polynomial Kevin
If P ⊂ R is a rational polytope, then iP (t) := #(tP ∩ Z ) is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P . A period of iP (t) is D(P ), the smallest D ∈ Z+ such that D · P has integral vertices. Often, D(P ) is the minimum period of iP (t), but, in several interesting examples, the minimum period is smaller. We prove that, for fixed d, there is a polynomial time algorithm...
متن کاملComputing the Period of an Ehrhart Quasi-Polynomial
If P ⊂ Rd is a rational polytope, then iP (t) := #(tP ∩Zd) is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P . A period of iP (t) is D(P ), the smallest D ∈ Z+ such that D ·P has integral vertices. Often, D(P ) is the minimum period of iP (t), but, in several interesting examples, the minimum period is smaller. We prove that, for fixed d, there is a polynomial time algorithm ...
متن کامل(Z)-Scissors Congruence in Rational Polytopes
Quasi-period collapse occurs when the Ehrhart quasi-polynomial of a rational polytope has a quasi-period less than the denominator of that polytope. This phenomenon is poorly understood, and all known cases in which it occurs have been proven with ad hoc methods. In this note, we present a conjectural explanation for quasi-period collapse in rational polytopes. We show that this explanation app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 109 شماره
صفحات -
تاریخ انتشار 2005